Matrix computations and polynomial root-finding with preprocessing
نویسندگان
چکیده
منابع مشابه
Fast Matrix Polynomial Computations
Pour une matrice polynomiale P(x) de degr e d dans Mn;n(Kx]), o u K est un corps commutatif, une r eduction a la forme normale d'Hermite peut ^ etre calcul ee en O ~ (M(nd)) op erations arithm etiques, si M(n) est le co^ ut du produit de deux matrices n n sur K. De plus, une telle r eduction peut ^ etre obtenue en temps parall ele O(log +1 (nd)) en utilisant O(L(nd)) processeurs, si le probl em...
متن کاملAccurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
In this paper we consider the application of polynomial root-finding methods to the solution of the tridiagonal matrix eigenproblem. All considered solvers are based on evaluating the Newton correction. We show that the use of scaled three-term recurrence relations complemented with error free transformations yields some compensated schemes which significantly improve the accuracy of computed r...
متن کاملReal Polynomial Root-Finding by Means of Matrix and Polynomial Iterations
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial has no nonreal roots, but typically nonreal roots are much more numerous than the real ones. The subject of devising efficient real root-finders has...
متن کاملTR-2014007: Real Polynomial Root-Finding by Means of Matrix and Polynomial Iterations
Recently we proposed to extend the matrix sign classical iteration to the approximation of the real eigenvalues of a companion matrix of a polynomial and consequently to the approximation of its real roots. In our present paper we advance this approach further by combining it with the alternative square root iteration for polynomials and also show a variation using repeated squaring in polynomi...
متن کاملPolynomial Root-Finding Algorithms and Branched Covers
Introduction. The problem of devising optimal methods for numerically approximating the roots of a polynomial has been of interest for several centuries, and is far from solved. There are numerous recent works on root-finding algorithms and their cost, for example, the work of Jenkins and Traub [JT70], Renegar [Ren87], Schönhage [Sch82], and Shub and Smale [SS85, SS86, Sma85]. This list is far ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.04.011